Discriminating semi-continuous HMM for speaker verification

نویسندگان

  • Mark E. Forsyth
  • Mervyn A. Jack
چکیده

This paper describes the use of a multiple codebook SCHMM speaker verification system, which uses a novel technique for discriminative hidden Markov modelling known as discriminative observation probabilities (DOP). DOP can easily be added to a multiple codebook HMM system and require minimal additional computation and no additional training. The DOP technique can be applied to both speech and speaker recognition. Results are presented for text-dependent experiments on isolated digits from 27 true speakers and 84 casud imposters, recorded over the public telephone network in the United Kingdom. DOP are shown to significantly improve speaker verification performance for several commonly used parameter sets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Using Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems

Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.

متن کامل

Using Exciting and Spectral Envelope Information and Matrix Quantization for Improvement of the Speaker Verification Systems

Speaker verification from talking a few words of sentences has many applications. Many methods as DTW, HMM, VQ and MQ can be used for speaker verification. We applied MQ for its precise, reliable and robust performance with computational simplicity. We also used pitch frequency and log gain contour for further improvement of the system performance.

متن کامل

Text dependent speaker verification using binary classifiers

This paper describes how a speaker verification task can be advantageously decomposed into a series of binary classification problems, i.e. each problem discriminating between two classes only. Each binary classifier is specific to one speaker, one anti-speaker and one word. Decision trees dealing with attributes of continuous values are used as classifiers. The set of classifiers is then prune...

متن کامل

Text Dependent Speaker Verification Using Binary Classifiers Text Dependent Speaker Verification Using Binary Classifiers

This paper describes how a speaker veri cation task can be advantageously decom posed into a series of binary classi cation problems i e each problem discriminating between two classes only Each binary classi er is speci c to one speaker one anti speaker and one word De cision trees dealing with attributes of continuous values are used as classi ers The set of classi ers is then pruned to elimi...

متن کامل

Comparison of continuous-density and semi-continuous HMM in isolated words recognition systems

Several types of Semi-Continuous HMM (SC-HMM) have been compared with the Continuous Density HMM (CD-HMM) in the context of Speaker Independent Isolated Words Recognition (SI-IWR). It is demonstrated that for the ten-digit vocabulary (TIDIGITS), the SC-HMM outperforms the CD-HMM when memory constraints are imposed on the system. SC-HMMs demonstrate recognition rate of about 95% with a total of ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1994